Search results for "Graph colouring"
showing 3 items of 3 documents
Total and fractional total colourings of circulant graphs
2008
International audience; In this paper, the total chromatic number and the fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional total chromatic number and for 4-regular circulant graphs we find the total chromatic number for some cases and we give the exact value of the fractional total chromatic number in most cases.
Latent Nestling Method: A new fault diagnosis methodology for complex systems
2008
This paper presents a new methodology for permanent and intermittent fault diagnosis, named faults latent nestling method (FLNM), using coloured Petri nets (CPNs). CPNs and FLNM method allow for an enhanced capability for synthesis and modelling of complex systems in contrast to the classical phenomena of combinational state explosion when using finite state machine based methods.
A Modified Tabu Thresholding Approach for the Generalised Restricted Vertex Colouring Problem
1996
We present a modification of the Tabu Thresholding (TT) approach and apply it to the solution of the generalised restricted vertex colouring problem. Both the bounded and unbounded cases are treated. In our algorithms, the basic TT elements are supplemented with an evaluation function that depends on the best solution obtained so far, together with a mechanism which reinforces the aggressive search in the improving phase, and new diversification strategies which depend on the state of the search. The procedure is illustrated through the solution of the problem of minimising the number of workers in a heterogeneous workforce.